//
// Created by Tiany on 2021/6/24.
//链表二叉树实现

#include "LinkBinTree.h"
#include "stdlib.h"
#include "stdio.h"

//创建二叉树：递归创建
PBinTreeNode creatBinTree(void){
    PBinTreeNode p;
    char ch;
    scanf("%c",&ch);//输入结点，空则输入$
    if(ch=='$')return NULL;
    else{
        p= malloc(sizeof (struct BinTreeNode));
        p->info.c=ch;
        p->leftlink=creatBinTree();
        p->rightlink=creatBinTree();
    }
    return p;
}